Asymptotic normality in random graphs with given vertex degrees
نویسندگان
چکیده
منابع مشابه
Monotonicity, asymptotic normality and vertex degrees in random graphs
We exploit a result by Nerman [23] which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs where we obtain asymptotic normality for the number of vertices with a given degree in the random graph G(n, m) with a fixed number of edges from the corresponding result for the random graph ...
متن کاملOn Percolation in Random Graphs with given Vertex Degrees
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for random graphs with given vertex degrees. This is used to study existence of giant component and existence of k-core. As a variation of the latter, we study also...
متن کاملSusceptibility of Random Graphs with given Vertex Degrees
We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In the supercritical case, a corresponding result holds for the modified susceptibility ignoring the giant component and the expected size of a finite cluster ...
متن کاملRandom graphs with forbidden vertex degrees
We study the random graph Gn,λ/n conditioned on the event that all vertex degrees lie in some given subset S of the nonnegative integers. Subject to a certain hypothesis on S , the empirical distribution of the vertex degrees is asymptotically Poisson with some parameter b μ given as the root of a certain ‘characteristic equation’ of S that maximizes a certain function ψS(μ). Subject to a hypot...
متن کاملBootstrap Percolation and Diffusion in Random Graphs with Given Vertex Degrees
We consider diffusion in random graphs with given vertex degrees. Our diffusion model can be viewed as a variant of a cellular automaton growth process: assume that each node can be in one of the two possible states, inactive or active. The parameters of the model are two given functions θ : N → N and α : N → [0, 1]. At the beginning of the process, each node v of degree dv becomes active with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2020
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20905